Multi Agent System in Job Shop Scheduling using Contract Net Protocol
نویسندگان
چکیده
منابع مشابه
Using Multi-Agent System for Dynamic Job Shop Scheduling
Today’s industries need more flexible scheduling systems able to produce new valid schedule in response to the modifications concerning orders, production processes and deliveries of materials. This paper introduces a multi-agent system applied to a job shop dynamic scheduling problem in which new production orders or deliveries arrive continuously and affect the already scheduled plan. We have...
متن کاملUsing Multi-agent System for Dynamic Job Shop Scheduling1
Today’s industries need more flexible scheduling systems able to produce new valid schedule in response to the modifications concerning orders, production processes and deliveries of materials. This paper introduces a multi-agent system applied to a job shop dynamic scheduling problem in which new production orders or deliveries arrive continuously and affect the already scheduled plan. We have...
متن کاملA multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کاملSimulating the generic job shop as a multi-agent system
A model combining Discrete Event System (DES) and Multi-Agent System (MAS) is proposed to simulate a real-time job shop so that it can work as a test bed to systematically study the performance of control rules and algorithms in dynamic job shop scheduling. A definition of a generic job shop is given considering dynamic events, shop floor layout and the Material Handling System (MHS). It is fir...
متن کاملSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/16444-6113